Kevin Van Bladel. « Zoroaster’s Many Languages »

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One Parser, Many Languages

We train a language-universal dependency parser on a multilingual collection of treebanks. The parsing model uses multilingual word embeddings alongside learned and specified typological information, enabling generalization based on linguistic universals and based on typological similarities. We evaluate our parser’s performance on languages in the training set as well as on the unsupervised sc...

متن کامل

Many Languages, One Parser

We train one multilingual model for dependency parsing and use it to parse sentences in several languages. The parsing model uses (i) multilingual word clusters and embeddings; (ii) token-level language information; and (iii) language-specific features (finegrained POS tags). This input representation enables the parser not only to parse effectively in multiple languages, but also to generalize...

متن کامل

Comparing Prosody Across Many Languages

An empirical metric is developed to measure similarity or distance between the prosodic systems of diverse languages. Two physical variables which carry prosodic information, F0 and amplitude envelope modulation, are used as inputs in a pairwise language discrimination task. A novel neural network model is trained to discriminate among pairs of languages drawn from a set of ten languages in a t...

متن کامل

A Corpus Factory for Many Languages

For many languages there are no large, general-language corpora available. Until the web, all but the richest institutions could do little but shake their heads in dismay as corpus-building was long, slow and expensive. But with the advent of the Web it can be highly automated and thereby fast and inexpensive. We have developed a `corpus factory' where we build large corpora. In this paper we d...

متن کامل

Too many languages satisfy Ogden's Lemma

There are various pumping lemmata for context free languages, the strongest of which is Ogden’s Lemma. It is known that it does not fully characterize context free languages. In an attempt to remedy the situation, Manaster– Ramer, Moshier and Zeitman have strengthened this lemma. As we shall show here, there exist non–semilinear languages that satisfy this stronger lemma and also the lesser kno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstracta Iranica

سال: 2019

ISSN: 0240-8910,1961-960X

DOI: 10.4000/abstractairanica.50858